Optimizing a Hierarchical Hub Covering Problem with Mandatory Dispersion of Central Hubs
Authors
Abstract:
The hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. This paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. This formulation with incorporating mandatory distance and covering constraints has not been remarked in the hierarchical hub location problem literature. To test the performance of the problem on the Turkish data, computational experiments carried out and the model outcomes give useful insight associating with the model sensitivity to its parameters.
similar resources
optimizing a hierarchical hub covering problem with mandatory dispersion of central hubs
the hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. this paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. this formulation with incorpor...
full textA Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
full textDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
full textSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
full textdynamic hub covering problem with flexible covering radius
abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...
full textA Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...
full textMy Resources
Journal title
volume 5 issue None
pages 17- 28
publication date 2015-02
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023